Bid construction scheme based on local search to solve serial–parallel cooperative batch scheduling problems

Combining Local Search and Linear Programming to Solve Earliness/Tardiness Scheduling Problems

A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems 125 A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems

Since the creation of operations research as a discipline, a continued interest has been in the development of heuristics or approximation algorithms to solve complex combinatorial optimization problems. As many problems have been proven computationally intractable, the heuristic approaches become increasingly important in solving various large practical problems. The most popular heuristics th...

Improving Local Search for Fuzzy Scheduling Problems

Introduction The integration of fuzzy set theory and fuzzy logic into scheduling is a rather new aspect with growing importance for manufacturing applications [1, 4], resulting in various unsolved aspects. In the current paper, we investigate an improved local search technique for fuzzy scheduling problems with fitness plateaus, using a multi criteria formulation of the problem. We especially a...

Profile-Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems

Though CSP scheduling models have tended to assume fairly general representations of temporal constraints, most work has restricted attention to problems that require allocation of simple, unit-capacity r~=,ources. This paper considers an extended class of scheduling problems where resources have capacity to simultaneously support more than one activity, and resource availability at any point i...

Solving a chemical batch scheduling problem by local search

A chemical batch scheduling problem is modeled in two different ways as a discrete optimization problem. Both models are used to solve the batch scheduling problem in a two-phase tabu search procedure. The method is tested on real world data.